منابع مشابه
Partitions of codes
In this thesis we look at coding theory wherein we introduce the concept of perspective, a generalisation on the minimum distance of a code, which naturally leads to a partition of the code. Subsequently we introduce focused splittings, which shall be shown to be a generalisation of perfect codes. We investigate the existence of such objects, and address questions such as the complexity of find...
متن کاملGray Codes, Loopless Algorithm and Partitions
The generation of efficient Gray codes and combinatorial algorithms that list all the members of a combinatorial object has received a lot of attention in the last few years. Knuth gave a code for the set of all partitions of [n] = {1, 2, . . . , n}. Ruskey presented a modified version of Knuth’s algorithm with distance 2. Ehrlich introduced a looplees algorithm for the set of the partitions of...
متن کاملAnalysis of Tourism Ethics Indicators and Codes
Background: Modern tourism has caused social, economic and environmental damage, in spite of its positive effects, in order to earn money and profit. One of the reasons for these problems is the lack of respect for ethical issues by tourists. The purpose of this article is to investigate and analyze the indicators and codes of ethical tourism from the viewpoint of tourists in the Ganjnameh tour...
متن کاملOn partitions into nonparallel Hamming codes
Let F denote the finite field with two elements. We describe a construction of partitions of F , for n = 2 − 1, m ≥ 4, into cosets of pairwise distinct Hamming codes (we call such codes nonparallel) of length n. We give a lower bound for the number of different such partitions.
متن کاملSymmetric Functions, Codes of Partitions and the Kp Hierarchy
We consider an operator of Bernstein for symmetric functions, and give an explicit formula for its action on an arbitrary Schur function. This formula is given in a remarkably simple form when written in terms of some notation based on the code of a partition. As an application, we give a new and very simple proof of a classical result for the KP hierarchy, which involves the Plücker relations ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 2011
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s0218196711006595